Solving the 0-1 Knapsack Problem with Genetic Algorithms Maya Hristakeva Computer Science Department Simpson College Dipti Shrestha

Source URL: www.assembla.com

• Computational complexity theory
• Crossover
• Knapsack problem
• Fitness proportionate selection
• Mutation
• Chromosome
• Selection
• Bin packing problem
• Population genetics
• Genetic algorithms
• Theoretical computer science
• Applied mathematics

Online Computation with Advice Yuval Emek1 ? , Pierre Fraigniaud2 ?? , Amos Korman2

Source URL: www.liafa.jussieu.fr

• Computational complexity theory
• Applied mathematics
• Competitive analysis
• K-server problem
• Randomized algorithm
• Metrical task system
• Adversary model
• Minimum spanning tree
• Bin packing problem
• Theoretical computer science
• Online algorithms
• Analysis of algorithms

Energy-Aware Service Allocation Damien Borgettoa , Henri Casanovab , Georges Da Costaa , Jean-Marc Piersona b a IRIT, University of Toulouse, Toulouse, France Department of Information and Computer Sciences University of

Source URL: navet.ics.hawaii.edu

• Operations research
• Computational complexity theory
• Convex optimization
• Linear programming
• Greedy algorithm
• Algorithm
• Reduction
• Bin packing problem
• Theoretical computer science
• Mathematics
• Applied mathematics

Resource Allocation using Virtual Clusters Mark Stillwell1 David Schanzenbach1 Fr´ed´eric Vivien2,3,4,1 Henri Casanova1 1 Department of Information and Computer Sciences, University of Hawai‘i at M¯anoa, Honolulu, U

Source URL: navet.ics.hawaii.edu

• Management
• Planning
• Convex optimization
• Linear programming
• Scheduling
• Algorithm
• Greedy algorithm
• Resource allocation
• Bin packing problem
• Mathematics
• Operations research
• Applied mathematics

CCCG 2011, Toronto ON, August 10–12, 2011 New Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem∗ Chia-Hong Hsu†

Source URL: 2011.cccg.ca

Three Dimensional Bin Packing Problem with Variable Bin Height Yong Wu a,b,∗ , Wenkai Li b , Mark Goh b,c , Robert de Souza b a Institute b The

Source URL: www98.griffith.edu.au

• Packaging
• Operations research
• Discrete geometry
• Bin packing problem
• Mathematical optimization
• Computational complexity theory
• Packing problem
• Carton
• Bounded-error probabilistic polynomial
• Theoretical computer science
• Mathematics
• Applied mathematics

Int. J. Production Economics ∎ (∎∎∎∎) ∎∎∎–∎∎∎ Contents lists available at SciVerse ScienceDirect Int. J. Production Economics journal homepage: www.elsevier.com/locate/ijpe

Source URL: isiarticles.com

• Theoretical computer science
• Operations research
• Mathematical optimization
• Combinatorial optimization
• Discrete geometry
• Bin packing problem
• Packing problem
• Genetic algorithm
• Cutting stock problem
• Mathematics
• Applied mathematics
• Packaging

Virtual Machine Resource Allocation for Service Hosting on Heterogeneous Distributed Platforms Mark Stillwell, Fr´ed´eric Vivien INRIA, France Email: ,

Source URL: navet.ics.hawaii.edu

• Operations research
• Scheduling algorithms
• Bin packing problem
• Algorithm
• Scheduling
• Greedy algorithm
• Grid computing
• Sequence container
• Mathematics
• Applied mathematics
• Theoretical computer science

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the d-Runaway Rectangle Escape Problem Aniket Basu Roy∗, Sathish Govindarajan∗, Neeldhara Misra∗, Shreyas Shetty∗ Abstract

Source URL: www.cccg.ca

• Logic
• Quadrilaterals
• Rectangle
• Bin
• Algorithm
• Special case
• R-tree
• Hilbert R-tree
• Packing problem
• Mathematical logic
• Geometry
• Mathematics

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Almost Online Square Packing Shahin Kamali Abstract

Source URL: www.cccg.ca

• Online algorithms
• Computer science
• Bin packing problem
• Theoretical computer science
• Packing problem
• Streaming algorithm
• Competitive analysis
• List update problem
• Algorithm
• Mathematics
• Applied mathematics
• Analysis of algorithms